Factoring N-Cycles and Counting Maps of Given Genus

نویسندگان

  • Alain Goupil
  • Gilles Schaeffer
چکیده

We present an explicit expression for the number of decompositions of an n−cycle as a product of any two permutations of cycle types given by partitions λ and μ. The same expression is also counting the number of unicellular rooted bicolored maps on an orientable surface of genus g with vertex degree distribution given by λ and μ. The relation between the genus and the partitions λ and μ is given by `(λ) + `(μ) = n + 1 − 2g where `(λ) is the number of parts of λ. We use character theory and the group algebra of the symmetric group to develop our expression. The key argument is the construction of a bijection involving the character formula at one end and our final expression at the other end.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Remarks on Iterated Maps of Natural Numbers

(right) M Ram Murty is also a Fellow of the Royal Society of Canada as well as Fellow the Indian Science Academy. He is currently Queen’s Research Chair in mathematics and philosophy at Queen’s University, Canada. The iterates of maps f : N → N given as a function of the digits of the number written in a fixed base b are dealt with here. For such maps, the iterates end up in a finite collection...

متن کامل

Counting rooted maps on a surface

Several enumeration results are known about rooted maps on orientable surfaces, whereas rooted maps on non-orientable surfaces have seldom been studied. First, we unify both kind of maps, giving general functional equations for the generating series which counts rooted maps on any locally orientable surface, by number of vertices and faces. Then, we formally solve these equations, in order to e...

متن کامل

Bijective Enumeration of Bicolored Maps of Given Vertex Degree Distribution

We derive a new formula for the number of factorizations of a full cycle into an ordered product of two permutations of given cycle types. For the first time, a purely combinatorial argument involving a bijective description of bicolored maps of specified vertex degree distribution is used. All the previous results in the field rely either partially or totally on a character theoretic approach....

متن کامل

Equivalence of Counting the Number of Points on Elliptic Curve over the Ring Zn and Factoring n

1 I n t r o d u c t i o n Elliptic curves can be applied to public-key cryptosystems, and as such several schemes have been proposed [3, 4, 5, 6, 9, 11]. There are two typical elliptic curve cryptosystems: E1Gamal-type scheme [4, 11] and RSA-type schemes [3, 5, 6]. The security of the EIGamal-type elliptic curve cryptosystem is based on the difficulty of solving a discrete logarithm over ellipt...

متن کامل

Combinatorial Constructions for Transitive Factorizations in the Symmetric Group

We consider the problem of counting transitive factorizations of permutations; that is, we study tuples (σr , . . . , σ1) of permutations on {1, . . . , n} such that (1) the product σr · · · σ1 is equal to a given target permutation π , and (2) the group generated by the factors σi acts transitively on {1, . . . , n}. This problem is widely known as the Hurwitz Enumeration Problem, since an enc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Eur. J. Comb.

دوره 19  شماره 

صفحات  -

تاریخ انتشار 1998